Deciding Extensions of the Theories of Vectors and Bags

نویسنده

  • Patrick Maier
چکیده

Vectors and bags are basic collection data structures, which are used frequently in programs and specifications. Reasoning about these data structures is supported by established algorithms for deciding ground satisfiability in the theories of arrays (for vectors) and multisets (for bags), respectively. Yet, these decision procedures are only able to reason about vectors and bags in isolation, not about their combination. This paper presents a decision procedure for the combination of the theories of vectors and bags, even when extended with a function bagof bridging between vectors and bags. The function bagof converts vectors into the bags of their elements, thus admitting vector/bag comparisons. Moreover, for certain syntactically restricted classes of ground formulae decidability is retained if the theory of vectors is extended further with a map function which applies uninterpreted functions to all elements of a vector.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Admissible Vectors of a Covariant Representation of a Dynamical System

In this paper, we introduce admissible vectors of covariant representations of a dynamical system which are extensions of the usual ones, and compare them with each other. Also, we give some sufficient conditions for a vector to be admissible vector of a covariant pair of a dynamical system.  In addition, we show the existence of Parseval frames for some special subspaces of $L^2(G)$ related to...

متن کامل

Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays

Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed in a combination of first-order theories. We present the architecture and selected features of Boolector, which is an efficient SMT solver for the quantifier-free theories of bit-vectors and arrays. It uses term rewriting, bit-blasting to handle bit-vectors, and lemmas on demand for ar...

متن کامل

Dilations‎, ‎models‎, ‎scattering and spectral problems of 1D discrete Hamiltonian systems

In this paper, the maximal dissipative extensions of a symmetric singular 1D discrete Hamiltonian operator with maximal deficiency indices (2,2) (in limit-circle cases at ±∞) and acting in the Hilbert space ℓ_{Ω}²(Z;C²) (Z:={0,±1,±2,...}) are considered. We consider two classes dissipative operators with separated boundary conditions both at -∞ and ∞. For each of these cases we establish a self...

متن کامل

Community’s perception of utilization and disposal of plastic bags in Eastern Ethiopia

Plastics, one of the most abundant materials in the world today, are one of the main sources of pollution. People’s perception of using and disposing plastic bags is primordial as they tend to be a major part of household solid waste. This study aims to determine community’s perception of usage and disposal of plastic bags in Eastern Ethiopia. A quantitative cross-sectional study has been condu...

متن کامل

Lambdas, Arrays and Quantifiers

Satisfiability Modulo Theories (SMT) refers to the problem of deciding the satisfiability of a first-order formula with respect to one or more first-order theories. In many applications of hardware and software verification, SMT solvers are employed as back-end engine to solve complex verification tasks that usually combine multiple theories, such as the theory of fixed-size bit-vectors and the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009